Parallel algorithms for moving boundary problems by local remeshing

Parallel local remeshing for moving body applications

This paper presents a parallel local remeshing approach on distributed parallel computers based on the message passing interfaces (MPI). In comparison to those existing approaches that require combining a single hole initially spanning multiple processors into one processor so that the sequential results can be reproduced, the proposed approach avoids this limit by decomposing the initially dis...

Parallel Algorithms for Boundary Value Problems

Three-dimensional adaptive domain remeshing, implicit domain meshing, and applications to free and moving boundary problems

Article history: Received 25 March 2013 Received in revised form 30 December 2013 Accepted 6 January 2014 Available online 13 January 2014

Stable Parallel Algorithms for Two-Point Boundary Value Problems

Some of the most widely used algorithms for two-point boundary value ODEs, namely nite diierence and collocation methods and standard multiple shooting, proceed by setting up and solving a structured system of linear equations. It is well known that the linear system can be set up eeciently in parallel; we show here that a structured orthogonal factorization technique can be used to solve this ...

Moving boundary problems governed by anomalous diffusion.

Anomalous diffusion can be characterized by a mean-squared displacement 〈x(2)(t)〉 that is proportional to t(α) where α≠1. A class of one-dimensional moving boundary problems is investigated that involves one or more regions governed by anomalous diffusion, specifically subdiffusion (α<1). A novel numerical method is developed to handle the moving interface as well as the singular history kernel...